A description based on languages of the final non-deterministic automaton
نویسندگان
چکیده
Article history: Received 20 December 2012 Received in revised form 12 December 2013 Accepted 14 January 2014 Communicated by R. van Glabbeek
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 536 شماره
صفحات -
تاریخ انتشار 2014